Extraction of Boundary Representation from Surface Triangulations∗
نویسندگان
چکیده
Many computational science tools employ finite element meshes as discretizations of the geometrical domains, and automatic mesh generation has become an indispensable part of the discretization process. Boundary representations (BRep) of solids are the means of describing the geometrical model to the mesher, thus enabling the generator to proceed without user intervention. Significant effort has been devoted in the past to BRep construction in the framework of solid modeling systems. In this paper we consider the task of converting a tesselation (triangulation) of the surface of a solid into a BRep, and we propose a robust and efficient set of algorithms for this purpose. Applications include, among others, remeshing of finite element discretizations during simulations involving not only geometric distortion but also changes in topology (coalescence and fragmentation of solids, flow, and so on).
منابع مشابه
A Fast Algorithm for Computing Irreducible Triangulations of Closed Surfaces in E and Its Application to the TriQuad Problem
Let S be a compact surface with empty boundary. A classical result from the 1920s by Tibor Radó asserts that every compact surface with empty boundary (usually called a closed surface) admits a triangulation [1]. Let e be any edge of a triangulation T of S . The contraction of e in T consists of contracting e to a single vertex and collapsing each of the two triangles meeting e into a single ed...
متن کاملLayered - Triangulations of 3 – Manifolds
A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...
متن کاملSuccinct Representation of Triangulations with a Boundary
We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented. For the case of planar triangulations with a boundary we propose a succinct representation of the combinatorial information that improves ...
متن کاملRepresentation and Visualization of Terrain Surfacesat Variable
We present a new approach for managing the multiresolution representation of discrete topographic surfaces. A Triangulated Irregular Network (TIN) representing the surface is built from sampled data by iteratively reening an initial triangulation that covers the whole domain. The reenement process generates triangulations of the domain corresponding to increasingly ner approximations of the sur...
متن کاملDynamic updates of succinct triangulations
In a recent article, we presented a succinct representation of triangulations that supports efficient navigation operations. Here this representation is improved to allow for efficient local updates of the triangulations. Precisely, we show how a succinct representation of a triangulation with m triangles can be maintained under vertex insertions in O(1) amortized time and under vertex deletion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999